Game Dynamics and Nash Equilibria
نویسنده
چکیده
There are games with a unique Nash equilibrium but such that, for almost all initial conditions, all strategies in the support of this equilibrium are eliminated by the replicator dynamics and the bestreply dynamics. MSC classification. Primary: 91A22 ; Secondary: 34A34, 34A60.
منابع مشابه
Nash Equilibria in Multi-Agent Motor Interactions
Social interactions in classic cognitive games like the ultimatum game or the prisoner's dilemma typically lead to Nash equilibria when multiple competitive decision makers with perfect knowledge select optimal strategies. However, in evolutionary game theory it has been shown that Nash equilibria can also arise as attractors in dynamical systems that can describe, for example, the population d...
متن کاملEvolutionary network games: equilibria from imitation and best-response dynamics
We consider games of strategic substitutes and strategic complements on networks. We introduce two different evolutionary dynamics in order to refine their multiplicity of equilibria, and we analyse the system through a mean field approach. We find that for the best-shot game, taken as a model for substitutes, a replicator-like dynamics does not lead to Nash equilibria, whereas it leads to uniq...
متن کاملCS364A: Algorithmic Game Theory Lecture #20: Mixed Nash Equilibria and PPAD-Completeness∗
Today we continue our study of the limitations of learning dynamics and polynomial-time algorithms for converging to and computing equilibria. Recall that we have sweeping positive results for coarse correlated and correlated equilibria, which are tractable in arbitrary games. We have only partial positive results for pure Nash equilibria of routing and congestion games, and last lecture we dev...
متن کاملComplexity of Game Dynamics
Complexity of Game Dynamics by Alexander Fabrikant Doctor of Philosophy in Computer Science University of California at Berkeley Professor Christos H. Papadimitriou, Chair What happens when independent agents interact based on their selfish interests? Game theory’s earliest and most natural simple model of such interaction is the best-response Nash dynamics, the process of agents making unilate...
متن کاملA Library for Algorithmic Game Theory in Ssreflect/Coq
We report on the formalization in Ssreflect/Coq of a number of concepts and results from algorithmic game theory, including potential games, smooth games, solution concepts such as Pure and Mixed Nash Equilibria, Coarse Correlated Equilibria, -approximate equilibria, and behavioral models of games such as better-response dynamics. We apply the formalization to prove Price of Stability bounds fo...
متن کاملSonderforschungsbereich 504 Brown-von Neumann-nash Dynamics: the Continuous Strategy Case
In John Nash’s proofs for the existence of (Nash) equilibria based on Brouwer’s theorem, an iteration mapping is used. A continuous— time analogue of the same mapping has been studied even earlier by Brown and von Neumann. This differential equation has recently been suggested as a plausible boundedly rational learning process in games. In the current paper we study this Brown—von Neumann—Nash ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1211.5329 شماره
صفحات -
تاریخ انتشار 2012